package com.itheima.array.array01;
//数组常见算法之冒泡排序
public class ArraryDemo5 {
    public static void main(String[] args) {

        int[] arr = {99,88,56,47,12,36,45,18,123,678,999,124};

        for (int i = 0; i < arr.length-1; i++) {
            for (int j = 0; j < arr.length-1-i; j++) {

                if (arr[j] > arr[j+1]){
                int temp = arr[j];
                arr[j] = arr[j+1];
                arr[j+1] = temp;}
            }
        }

        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i]+ " ");
        }
    }
}
